Stabilized Explicit-Implicit Domain Decomposition Methods for the Numerical Solution of Parabolic Equations

نویسندگان

  • Yu Zhuang
  • Xian-He Sun
چکیده

We report a class of stabilized explicit-implicit domain decomposition (SEIDD) methods for the numerical solution of parabolic equations. Explicit-implicit domain decomposition (EIDD) methods are globally noniterative, nonoverlapping domain decomposition methods, which, when compared with Schwarz-algorithm-based parabolic solvers, are computationally and communicationally efficient for each simulation time step but suffer from small time step size restrictions. By adding a stabilization step to EIDD, the SEIDD methods retain the time-stepwise efficiency in computation and communication of the EIDD methods but exhibit much better numerical stability. Three SEIDD algorithms are presented in this paper, which are experimentally tested to show excellent stability, computation and communication efficiencies, and high parallel speedup and scalability.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Explicit Implicit Non Overlapping Domain Decomposition Method with Splitting up method for Multi Dimensional Parabolic Problem

The explicit implicit domain decomposition methods are a non iterative types of methods for non overlapping domain decomposition. In comparison with the classical Schwarz algorithm for parabolic problem the former methods are computationally and communicationally more efficient for each time step but due to the use of the explicit step for the interface prediction the methods suffer from the ac...

متن کامل

Stable, Gloablly Non-iterative, Non-overlapping Domain Decomposition Parallel Solvers for Parabolic Problems

In this paper, we report a class of stabilized explicit-implicit domain decomposition (SEIDD) methods for the parallel solution of parabolic equations, based on the explicit-implicit domain decomposition (EIDD) methods. EIDD methods are globally non-iterative, non-overlapping domain decomposition methods which, when compared with Schwarz alternating algorithm based parabolic solvers, are comput...

متن کامل

Novel Finite Difference Discretization of Interface Boundary Conditions for Stablized Explicit-Implicit Domain Decomposition Methods

Stabilized explicit-implicit domain decomposition is a group of methods for solving time-dependent partial difference equations of the parabolic type on parallel computers. They are efficient, stable, and highly parallel, but suffer from a restriction that the interface boundaries must not intersect inside the domain. Various techniques have been proposed to handle this restriction. In this pap...

متن کامل

Efficient Parallel Algorithms for Parabolic Problems

Domain decomposition algorithms for parallel numerical solution of parabolic equations are studied for steady state or slow unsteady computation. Implicit schemes are used in order to march with large time steps. Parallelization is realized by approximating interface values using explicit computation. Various techniques are examined, including a multistep second order explicit scheme and a one-...

متن کامل

Domain decomposition schemes with high-order accuracy and unconditional stability

Parallel finite difference schemes with high-order accuracy and unconditional stability for solving parabolic equations are presented. The schemes are based on domain decomposition method, i.e., interface values between subdomains are computed by the explicit scheme; interior values are computed by the implicit scheme. The numerical stability and error are derived in the H norm in one dimension...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2002